Efficient Evaluation of Imprecise Location-Dependent Queries (Technical Report)

نویسندگان

  • Jinchuan Chen
  • Reynold Cheng
چکیده

In location-based services, it is common for a user to issue a query based on her current position. An example is the location-dependent range query, where the user’s location is at the center of the query range. Very often, the query issuer’s location is imprecise due to measurement error, sampling error, or message delay. She may also want to protect her privacy by providing a less precise location. In this paper, we study the efficiency of queries that return probabilistic guarantees for location data with uncertainty. We classify this query into two types, based on whether the data (1) has no uncertainty (e.g., shops and restaurants), or (2) has a controlled degree of uncertainty (e.g., moving vehicles). Based on this classification, we develop three methods to improve the computational and I/O performance. The first method expands the query range based on the query issuer’s uncertainty. The second method exchanges the roles of query and data. The third method exploits the fact that users may only be interested in answers with probabilities higher than some threshold. Experimental simulation over a realistic dataset reveals that our approaches improve the query performance significantly.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Managing Large-scale Probabilistic Databases

Managing Large-scale Probabilistic Databases Christopher Ré Chair of the Supervisory Committee: Professor Dan Suciu Computer Science & Engineering Modern applications are driven by data, and increasingly the data driving these applications are imprecise. The set of applications that generate imprecise data is diverse: In sensor database applications, the goal is to measure some aspect of the ph...

متن کامل

Trajectory Possible Nearest Neighbor Queries over Imprecise Location Data

Trajectory queries, which retrieve nearby objects for every point of a given route, can be used to identify alerts of potential threats along a vessel route, or monitor the adjacent rescuers to a travel path. However, the locations of these objects (e.g., threats, succours) may not be precisely obtained due to hardware limitations of measuring devices, as well as complex natures of the surround...

متن کامل

Continuous Probabilistic Count Queries in Wireless Sensor Networks

Count queries in wireless sensor networks report the number of sensor nodes for which the measured values satisfy a given query predicate. However, measurements in wireless sensor networks are typically imprecise due to limited accuracy of the sensor hardware or fluctuations in the observed environment. Consequently, queries performed on these imprecise information implicate imprecise answers. ...

متن کامل

Efficient Evaluation of HAVING Queries on a Probabilistic Database

We study the evaluation of positive conjunctive queries with Boolean aggregate tests (similar to HAVING queries in SQL) on probabilistic databases. Our motivation is to handle aggregate queries over imprecise data resulting from information integration or information extraction. More precisely, we study conjunctive queries with predicate aggregates using MIN, MAX, COUNT, SUM, AVG or COUNT(DISTI...

متن کامل

FP-CPNNQ: A Filter-Based Protocol for Continuous Probabilistic Nearest Neighbor Query

An increasing number of applications in environmental monitoring and location-based services make use of large-scale distributed sensing provided by wireless sensor networks. In such applications, a large number of sensor devices are deployed to collect useful information such as temperature readings and vehicle positions. However, these distributed sensors usually have limited computational an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006